Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
121	New results for the 2-interval pattern problem Guillaume Blin1 , Guillaume Fertin1 , and Stéphane Vialette2 1 LINA, FRE CNRS 2729 Université de Nantes, 2 rue de la Houssinière Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Trapezoid graph Interval graph Independent set Clique Matching Intersection graph Comparability graph Chordal graph Trivially perfect graph Interval scheduling
122	43 Documenta Math. ¨ nigsberg, Euler, Mei-Ko Kwan, Ko Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2012-07-25 10:24:40 Graph theory NP-complete problems Eulerian path Route inspection problem Cycle Degree Leonhard Euler Matching Seven Bridges of Knigsberg 2-factor theorem
123	Distance Three Labelings of Trees∗ Jiˇr´ı Fiala† Petr A. Golovach‡ Bernard Lidick´ Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:05 NP-complete problems Graph coloring NP-hard problems Graph theory Planar graphs Treewidth Graph Independent set Tree decomposition Outerplanar graph Tree Graph labeling
124	Parameterized Complexity Dichotomy for Steiner Multicut∗ Karl Bringmann† Danny Hermelin‡ Matthias Mnich§ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:47:29 NP-complete problems Graph operations Steiner tree problem Treewidth Edge contraction Graph Spanning tree Graph connectivity Minimum bottleneck spanning tree Planar separator theorem
125	Enumeration of Simple Complete Topological Graphs Jan Kynˇcl Charles University, Prague Graph: Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2007-09-07 22:46:32 Topological graph theory Graph Topological graph End Planar graph Graph embedding
126	Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Polygons NP-complete problems Computational problems Computational geometry Combinatorial optimization Art gallery problem Visibility graph Simple polygon Clique Cut Optimization problem Polygon covering
127	Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati Add to Reading List Source URL: www.cs.siu.edu Language: English - Date: 2015-11-12 17:19:02 NP-complete problems Theoretical computer science Analysis of algorithms Parameterized complexity Independent set Algorithm Kernelization Book:Graph Theory Book:Graph Algorithms
128	SIAM J. DISCRETE MATH. Vol. 23, No. 4, pp. 1800–1813 c 2009 Society for Industrial and Applied Mathematics Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2010-04-26 06:33:56 NP-complete problems Trapezoid graph Graph coloring Independent set Intersection graph Interval graph Clique Perfect graph Pathwidth Planar graph
129	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP∗ Matthias Englert Heiko R¨oglin Add to Reading List Source URL: www.dcs.warwick.ac.uk Language: English - Date: 2008-09-04 11:36:22 NP-hard problems NP-complete problems Operations research Travelling salesman problem Gadget Graph
130	Finding vertex-surjective graph homomorphisms⇤ Petr A. Golovach†, Bernard Lidick´ y‡, † Barnaby Martin, and Dani¨el Paulusma† Add to Reading List Source URL: orion.math.iastate.edu Language: English - Date: 2014-08-22 14:45:03 Morphisms Graph theory NP-complete problems Graph coloring Graph operations Pathwidth Graph homomorphism Treewidth Cograph Graph isomorphism Indifference graph Clique-width

UPDATE